Explicit Contexts in LF
نویسنده
چکیده
The standard methodology for representing deductive systems in LF identifies the object’s language’s context with the LF context. Consequently, any variable dealt with explicitly by any judgement or metatheorem must be last in the context. When the object language is dependently typed, this can pose a problem for establishing some metatheoretic results, since dependent hypotheses cannot be re-ordered at will. This paper presents a general technique that addresses such problems, based on representing the object language’s context as an explicit object in LF while retaining the use of higher-order representation for the object language’s syntax. A central result is that it is possible to convert between explicit and implicit contexts, which makes it feasible to use the standard methodology for most developments, but use explicit contexts where necessary. We do not propose any extensions to LF; the technique can be utilized in standard LF.
منابع مشابه
Explicit Contexts in LF (Revised)
The standard methodology for representing deductive systems in LF identifies the object’s language’s context with the LF context. Consequently, any variable dealt with explicitly by any judgement or metatheorem must be last in the context. When the object language is dependently typed, this can pose a problem for establishing some metatheoretic results, since dependent hypotheses cannot be re-o...
متن کاملProgramming proofs: a novel approach based on contextual types
We present an overview of Beluga, a dependently-typed programming and proof development environment. Beluga uses a two-level approach: it supports specifying formal systems within the logical framework LF and on top of LF, it provides a dependently-typed functional language that supports manipulating and analyzing LF objects via pattern matching. A distinct feature of Beluga is the explicit sup...
متن کاملVariable Arity for LF Work in Progress
The dependently-typed lambda calculus (LF) supports use of meta-level binding in reasoning about bindings and hypotheticals in programming languages. That is, lambda expressions in LF can be used to model binders and hypothetical judgments depending on fixed-size contexts. However, because LF does not have a concept of variable-arity functions, a hypothetical judgment depending on a variable-si...
متن کاملThe Acquisition of Definiteness Feature by Persian L2 Learners of English
The definiteness feature in English is both LF and PF interpretable while Persian is a language in which this feature is LF-interpretable but PF-uninterpretable. Hence, there is no overt article or morphological inflection in Persian denoting a definite context. Furthermore, Persian partially encodes specificity not definiteness. In definiteness both the speaker and hearer are involved while in...
متن کاملThe brain adjusts grip forces differently according to gravity and inertia: a parabolic flight experiment
In everyday life, one of the most frequent activities involves accelerating and decelerating an object held in precision grip. In many contexts, humans scale and synchronize their grip force (GF), normal to the finger/object contact, in anticipation of the expected tangential load force (LF), resulting from the combination of the gravitational and the inertial forces. In many contexts, GF and L...
متن کامل